Learning to classify structured data by graph propositionalization

نویسندگان

  • Thashmee Karunaratne
  • Henrik Boström
چکیده

Existing methods for learning from structured data are limited with respect to handling large or isolated substructures and also impose constraints on search depth and induced structure length. An approach to learning from structured data using a graph based propositionalization method, called finger printing, is introduced that addresses the limitations of current methods. The method is implemented in a system called DIFFER, which is demonstrated to compare favorable to existing state-of-art methods on some benchmark data sets. It is shown that further improvements can be obtained by combining the features generated by finger printing with features generated by previous methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ensemble Relational Learning based on Selective Propositionalization

Dealing with structured data needs the use of expressive representation formalisms that, however, puts the problem to deal with the computational complexity of the machine learning process. Furthermore, real world domains require tools able to manage their typical uncertainty. Many statistical relational learning approaches try to deal with these problems by combining the construction of releva...

متن کامل

Efficiency-conscious propositionalization for relational learning

Systems aiming at discovering interesting knowledge in data, now commonly called data mining systems, are typically employed in nding patterns in a single relational table. Most of mainstream data mining tools are not applicable in the more challenging task of nding knowledge in structured data represented by a multi-relational database. Although a family of methods known as inductive logic pro...

متن کامل

Statistical relational learning : Structure learning for Markov logic networks. (Apprentissage statistique relationnel : apprentissage de structures de réseaux de Markov logiques)

A Markov Logic Network is composed of a set of weighted first-order logic formulas. In this dis-sertation we propose several methods to learn a MLN structure from a relational dataset. Thesemethods are of two kinds: methods based on propositionalization and methods based on Graphof Predicates. The methods based on propositionalization are based on the idea of building aset o...

متن کامل

Binary Vector based Propositionalization Strategy for Multivalued Relations in Linked Data

Machine learning on linked data is strongly dependent on the selection of high quality data features to achieve good results and build reusable and generalizable models. In this work, we explore the problem of representing multivalued relations in a suitable form for machine learning while keeping the human comprehensibility of the resulting model. Specifically, we propose the use of a binary v...

متن کامل

EFFICIENCY-CONSCIOUS PROPOSITIONALIZATIONFOR RELATIONAL LEARNING Part Two: Boosting Efficiency

Systems aiming at discovering interesting knowledge in data, now commonly called data mining systems, are typically employed in finding patterns in a single relational table. Most of mainstream data mining tools are not applicable in the more challenging task of finding knowledge in structured data represented by a multi-relational database. Although a family of methods known as inductive logic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006